|
In mathematics, a filter is a special subset of a partially ordered set. For example, the power set of some set, partially ordered by set inclusion, is a filter. Filters appear in order and lattice theory, but can also be found in topology whence they originate. The dual notion of a filter is an ideal. Filters were introduced by Henri Cartan in 1937〔H. Cartan, ("Théorie des filtres" ), ''CR Acad. Paris'', 205, (1937) 595–598.〕〔H. Cartan, ("Filtres et ultrafiltres" ), ''CR Acad. Paris'', 205, (1937) 777–779.〕 and subsequently used by Bourbaki in their book ''Topologie Générale'' as an alternative to the similar notion of a net developed in 1922 by E. H. Moore and H. L. Smith. == Motivation == Intuitively, a filter on a partially ordered set (''poset'') contains those elements that are large enough to satisfy some criterion. For example, if ''x'' is an element of the poset, then the set of elements that are above ''x'' is a filter, called the principal filter at ''x''. (Notice that if ''x'' and ''y'' are incomparable elements of the poset, then neither of the principal filters at ''x'' and ''y'' is contained in the other one.) Similarly, a filter on a set contains those subsets that are sufficiently large to contain ''something''. For example, if the set is the real line and ''x'' is one of its points, then the family of sets that contain ''x'' in their interior is a filter, called the filter of neighbourhoods of ''x''. (Notice that the ''thing'' in this case is slightly larger than ''x'', but it still doesn't contain any other specific point of the line.) The above interpretations do not really, without elaboration, explain the condition 2. of the general definition of filter. For, why should two "large enough" things contain a ''common'' "large enough" thing? (Note, however, that they do explain conditions 1 and 3: Clearly the empty set is not "large enough", and clearly the collection of "large enough" things should be "upward closed".) Alternatively, a filter can be viewed as a "locating scheme": Suppose we try to locate something (a point or a subset) in the space X. Call a filter the ''collection of subsets of X that might contain "what we are looking for".'' Then this "filter" should possess the following natural structure: 1. Empty set cannot contain anything so it will not belong to our filter. 2. If two subsets, E and F, both might contain "what we are looking for", then so might their intersection. Thus our filter should be closed with respect to finite intersection. 3. If a set E might contain "what we are looking for", so might any superset of it. Thus our filter is upward closed. An ultrafilter can be viewed as a "perfect locating scheme" where ''each'' subset E of the space X can be used in deciding whether "what we are looking for" might lie in E. From this interpretation compactness (see the mathematical characterization below) can be viewed as the property that ''no location scheme can end up with nothing'', or to put it another way, ''we will always find something''. The mathematical notion of filter provides a precise language to treat these situations in a rigorous and general way, which is useful in analysis, general topology and logic. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Filter (mathematics)」の詳細全文を読む スポンサード リンク
|